Prüfer-like conditions and pullbacks
نویسندگان
چکیده
منابع مشابه
Categorical Pullbacks
The main purpose of this article is to introduce the categorical concept of pullback in Mizar. In the first part of this article we redefine homsets, monomorphisms, epimorpshisms and isomorphisms [6] within a free-object category [15] and it is shown there that ordinal numbers can be considered as categories. Then the pullback is introduced in terms of its universal property, and the Pullback L...
متن کاملCurves and coherent Prüfer rings
Usual definitions of Dedekind domain are not well suited for an algorithmic treatment. Indeed, the notion of Noetherian rings is subtle from a constructive point of view, and to be able to get prime ideals involve strong hypotheses. For instance, if k is a field, even given explicitely, there is in general no method to factorize polynomials in k[X]. The work [2] analyses the notion of Dedekind ...
متن کاملPushouts, Pullbacks and Their Properties
Graph rewriting has numerous applications, such as software engineering and biology techniques. This technique is theoretically based on pushouts and pullbacks, which are involved with given categories. This paper deals with the definition of pushout and pullback, and their properties.
متن کاملPrüfer codes for acyclic hypertrees
We describe a new Prüfer code based on star-reductions which works for infinite acyclic hypertrees.
متن کاملA note on Prüfer-like coding and counting forests of uniform hypertrees
The present note is designing encoding and decoding algorithms for a forest of rooted uniform hypertrees and hypercycles in linear time, by using as little as n− 2 integers in the range [1, n]. This simple extension of the classical Prüfer code for rooted trees to an encoding for forests of rooted uniform hypertrees and hypercycles makes it possible to count them up, according to their number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2004
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2004.04.012